Analytical solution of average path length for Apollonian networks
نویسندگان
چکیده
منابع مشابه
Analytical solution of average path length for Apollonian networks.
With the help of recursion relations derived from the self-similar structure, we obtain the solution of average path length, d[over ]_(t) , for Apollonian networks. In contrast to the well-known numerical result d[over ]_{t} proportional, variant(ln N_(t));(3/4) [J. S. Andrade, Jr., Phys. Rev. Lett. 94, 018702 (2005)], our rigorous solution shows that the average path length grows logarithmical...
متن کاملFuzzy Weighted Average - Analytical Solution
An algorithm is presented for the computation of analytical expressions for the extremal values of the α-cuts of the fuzzy weighted average, for triangular or trapeizoidal weights and attributes. Also, an algorithm for the computation of the inverses of these expressions is given, providing exact membership functions of the fuzzy weighted average. Up to now, only algorithms exist for the comput...
متن کاملsemi-analytical solution for static and forced vibration problems of laminated beams through smooth fundamental functions method
در این پایان نامه روش جدیدی مبتنی بر روش حل معادلات دیفرانسیل پارهای بر اساس روش توابع پایه برای حل مسایل ارتعاش اجباری واستاتیک تیرها و صفحات لایه ای ارایه شده است که می توان تفاوت این روش با روش های متداول توابع پایه را در استفاده از توابع هموار در ارضاء معادلات حاکم و شرایط مرزی دانست. در روش ارایه شده در این پایاننامه از معادله تعادل به عنوان معادله حاکم بر رفتار سیستم استفاده شده است که مو...
15 صفحه اولAnalysis of Average Shortest-Path Length of Scale-Free Network
Computing the average shortest-path length of a large scale-free network needs much memory space and computation time. Hence, parallel computing must be applied. In order to solve the load-balancing problem for coarse-grained parallelization, the relationship between the computing time of a single-source shortest-path length of node and the features of node is studied. We present a dynamic prog...
متن کاملOn the Average Path Length of Deterministic and Stochastics Recursive Networks
The average shortest path distance ` between all pairs of nodes in real-world networks tends to be small compared to the number of nodes. Providing a closed-form formula for ` remains challenging in several network models, as shown by recent papers dedicated to this sole topic. For example, Zhang et al. proposed the deterministic model ZRG and studied an upper bound on `. In this paper, we use ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2008
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.77.017102